On Ordered Polycyclic Groups
نویسنده
چکیده
It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpotent by abelian, and polycyclic.
منابع مشابه
Hyperbolic geometry, continued fractions and classification of the finitely generated totally ordered dimension groups
We classify polycyclic totally ordered dimension groups, i.e. dimension groups generated by dense embeddings of the lattice Zn in the real line R . Our method is based on geometry of simple geodesics on the modular surface of genus g ≥ 2. The main theorem says that isomorphism classes of the polycyclic totally ordered dimension group are bijective with the reals α modulo the action of the group...
متن کاملConvex $L$-lattice subgroups in $L$-ordered groups
In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...
متن کاملOrdered vacancy network induced by the growth of epitaxial graphene on Pt(111).
We have studied large areas of (√3×√3)R30° graphene commensurate with a Pt(111) substrate. A combination of experimental techniques with ab initio density functional theory indicates that this structure is related to a reconstruction at the Pt surface, consisting of an ordered vacancy network formed in the outermost Pt layer and a graphene layer covalently bound to the Pt substrate. The formati...
متن کاملPolycyclic Groups: a New Platform for Cryptology?
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کامل